The complete set of minimal simple graphs that support unsatisfiable 2-CNFs
نویسندگان
چکیده
منابع مشابه
A Method for Constructing Minimally Unsatisfiable CNFs
Ivor Spence[1] has developed an ingenious method for easily generating unsatisfiable 3-cnfs that turn out to be rather difficult for ATPs (automated theorem provers). In this paper, we generalize his construction to cnfs of arbitrary clause length and then show that the unsatisfiable cnfs generated are, usually, “minimally unsatisfiable,” that is, the removal of even one clause results in a sat...
متن کاملUnsatisfiable Linear k-CNFs Exist, for every k
We call a CNF formula linear if any two clauses have at most one variable in common. Let Linear k-SAT be the problem of deciding whether a given linear k-CNF formula is satisfiable. Here, a k-CNF formula is a CNF formula in which every clause has size exactly k. It was known that for k ≥ 3, Linear k-SAT is NP-complete if and only if an unsatisfiable linear k-CNF formula exists, and that they do...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملOn the Size of Minimal Unsatisfiable Formulas
An unsatisfiable formula is called minimal if it becomes satisfiable whenever any of its clauses are removed. We construct minimal unsatisfiable k-SAT formulas with Ω(nk) clauses for k ≥ 3, thereby negatively answering a question of Rosenfeld. This should be compared to the result of Lovász [Studia Scientiarum Mathematicarum Hungarica 11, 1974, p113-114] which asserts that a critically 3-chroma...
متن کاملCharacter Degree Graphs That Are Complete Graphs
Let G be a finite group, and write cd(G) for the set of degrees of irreducible characters of G. We define Γ(G) to be the graph whose vertex set is cd(G) − {1}, and there is an edge between a and b if (a, b) > 1. We prove that if Γ(G) is a complete graph, then G is a solvable group.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.12.017